Pendant tree-connectivity
نویسندگان
چکیده
منابع مشابه
Intrathoracic Airway Tree Segmentation from CT Images Using a Fuzzy Connectivity Method
Introduction: Virtual bronchoscopy is a reliable and efficient diagnostic method for primary symptoms of lung cancer. The segmentation of airways from CT images is a critical step for numerous virtual bronchoscopy applications. Materials and Methods: To overcome the limitations of the fuzzy connectedness method, the proposed technique, called fuzzy connectivity - fuzzy C-mean (FC-FCM), utilized...
متن کاملConnectivity and tree structure in finite graphs
Considering systems of separations in a graph that separate every pair of a given set of vertex sets that are themselves not separated by these separations, we determine conditions under which such a separation system contains a nested subsystem that still separates those sets and is invariant under the automorphisms of the graph. As an application, we show that the k-blocks – the maximal verte...
متن کاملAlgebraic connectivity of trees with a pendant edge of infinite weight
Let G be a weighted graph. Let v be a vertex of G and let Gω denote the graph obtained by adding a vertex u and an edge {v, u} with weight ω to G. Then the algebraic connectivity μ(Gω) of G v ω is a nondecreasing function of ω and is bounded by the algebraic connectivity μ(G) of G. The question of when lim ω→∞ v ω) is equal to μ(G) is considered and answered in the case that G is a tree.
متن کاملExpected length of pendant and interior edges of a Yule tree
The Yule (pure-birth) model is the simplest null model of speciation; each lineage gives rise to a new lineage independently with the same rate λ. We investigate the expected length of an edge chosen at random from the resulting evolutionary tree. In particular, we compare the expected length of a randomly selected edge with the expected length of a randomly selected pendant edge. We provide so...
متن کاملThe intersection of all maximum stable sets of a tree and its pendant vertices
A stable set in a graph G is a set of mutually non-adjacent vertices, α(G) is the size of a maximum stable set of G, and core(G) is the intersection of all its maximum stable sets. In this paper we demonstrate that in a tree T , of order n ≥ 2, any stable set of size ≥ n/2 contains at least one pendant vertex. Hence, we deduce that any maximum stable set in a tree contains at least one pendant ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1985
ISSN: 0095-8956
DOI: 10.1016/0095-8956(85)90083-8